منابع مشابه
Centralized Coded Caching of Correlated Contents
Coded caching and delivery is studied taking into account the correlations among the contents in the library. Correlations are modeled as common parts shared by multiple contents; that is, each file in the database is composed of a group of subfiles, where each subfile is shared by a different subset of files. The number of files that include a certain subfile is defined as the level of commonn...
متن کاملFrom Centralized to Decentralized Coded Caching
We consider the problem of designing decentralized schemes for coded caching. In this problem there are K users each cachingM files out of a library of N total files. The question is to minimizeR, the number of broadcast transmissions to satisfy all the user demands. Decentralized schemes allow the creation of each cache independently, allowing users to join or leave without dependencies. Previ...
متن کاملFundamental Limits of Caching: Improved Bounds with Coded Prefetching
We consider a cache network in which a single server is connected to multiple users via a shared error free link. The server has access to a database with N files of equal length F , and serves K users each with a cache memory of MF bits. A novel centralized coded caching scheme is proposed for scenarios with more users than files N ≤ K and cache capacities satisfying 1 K ≤ M ≤ N K . The propos...
متن کاملCentralized coded caching schemes: A hypergraph theoretical approach
The centralized coded caching scheme is a technique proposed by Maddah-Ali and Niesen as a solution to reduce the network burden in peak times in a wireless network system. Yan et al. reformulate the problem as designing a corresponding placement delivery array and propose two new schemes from this perspective. These schemes above significantly reduce the transmission rate R, compared with the ...
متن کاملOptimal Error Correcting Delivery Scheme for Coded Caching with Symmetric Batch Prefetching
Coded caching is used to reduce network congestion during peak hours. A single server is connected to a set of users through a bottleneck link, which generally is assumed to be errorfree. During non-peak hours, all the users have full access to the files and they fill their local cache with portions of the files available. During delivery phase, each user requests a file and the server delivers...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal on Selected Areas in Communications
سال: 2018
ISSN: 0733-8716,1558-0008
DOI: 10.1109/jsac.2018.2844959